Parameterized games of perfect information

Games with Perfect Information

Perfect-Information Stochastic Parity Games

We show that in perfect-information stochastic parity games with a finite state space both players have optimal pure positional strategies. Contrary to the recent proofs of this fact by K. Chatterejee, M. Jurdziński, T.A. Henzinger [2] and A.K. McIver, C.C. Morgan [14] the proof given in this paper proceeds by a straightforward induction on the number of outgoing transitions available to one of...

Perfect Information Stochastic Priority Games

We introduce stochastic priority games — a new class of perfect information stochastic games. These games can take two different, but equivalent, forms. In stopping priority games a play can be stopped by the environment after a finite number of stages, however, infinite plays are also possible. In discounted priority games only infinite plays are possible and the payoff is a linear combination...

The simple geometry of perfect information games

Perfect information games have a particularly simple structure of equilibria in the associated normal form. For generic such games each of the finitely many connected components of Nash equilibria is contractible. For every perfect information game there is a unique connected and contractible component of subgame perfect equilibria. Finally, the graph of the subgame perfect equilibrium correspo...

Dynamic Games with Perfect Awareness Information

I study dynamic games where players may be unaware of some fundamentals of the game itself, such as actions or players, and such unawareness may be lifted by other players’ actions during the play. Based on Li (2006a, 2006b), I propose a framework to deal with such games using standard tools of game theory. I construct examples to show that unawareness is distinctly different from assigning zer...